#include <iostream>
#include <unordered_map>

using namespace std;

int main()
{
	unordered_map<int, int> p;
	int n = 0;
	int m = 0;
	int max_num = 0;
	cin >> n;
	int len = n;
	while (n--)
	{
		cin >> m;
		p[m]++;
		max_num = max(max_num, p[m]);

	}
	cout << (max_num == len ? len : max_num + 1) << endl;
	return 0;
}